Extended generalized Voigt-type functions and related bounds

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Integral Representations of Generalized Relative Type and Generalized Relative Weak Type of Entire Functions

In this paper we wish to establish the integral representations of generalized relative type and generalized relative weak type as introduced by Datta et al [9]. We also investigate their equivalence relation under some certain conditions.

متن کامل

On the Distribution Functions of the Range and Quasi-range for the Extended Type I Generalized Logistic Distribution

In this paper, we obtain the distribution functions of the range and the quasi-range of the random variables arising from the extended type I generalized logistic distribution.

متن کامل

Generalized Ritt type and generalized Ritt weak type connected growth properties of entire functions represented by vector valued Dirichlet series

In this paper, we introduce the idea of generalized Ritt type and generalised Ritt weak type of entire functions represented by a vector valued Dirichlet series. Hence, we study some growth properties of two entire functions represented by a vector valued Dirichlet series on the basis of generalized Ritt type and generalised Ritt weak type.

متن کامل

Bounds for Zeta and Related Functions

Sharp bounds are obtained for expressions involving Zeta and related functions at a distance of one apart. Since Euler discovered in 1736 a closed form expression for the Zeta function at the even integers, a comparable expression for the odd integers has not been forthcoming. The current article derives sharp bounds for the Zeta, Lambda and Eta functions at a distance of one apart. The methods...

متن کامل

Redundancy-Related Bounds on Generalized Huffman Codes

This paper presents new lower and upper bounds for the compression rate of optimal binary prefix codes on memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for minimum (arithmetic) average redundancy coding — Huffman coding — these are in terms of a form of entropy and/or the probability of the most probable input symbol. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Classical Analysis

سال: 2023

ISSN: ['1848-5979', '1848-5987']

DOI: https://doi.org/10.7153/jca-2023-21-05